Mining Indirect Association between Itemsets

Discovering association rules is one of the important tasks in data mining. While most of the existing algorithms are developed for efficient mining of frequent patterns, it has been noted recently that some of the infrequent patterns, such as negative associations and indirect associations, provide useful insight into the data. Existing indirect association mining algorithms mine indirect associations between items and require two join operations. But in this paper, we propose an algorithm for mining the complete set of indirect associations between pair of items and itemsets which require only one join operation.